Approximate Pattern Matching in Nanotechnology
نویسندگان
چکیده
Approximate pattern matching is comparing an unknown pattern with a database of stored patterns with a specified error tolerance. This ability to compensate for real world sensor errors makes approximate pattern matching an ideal choice for a wide range of applications including fingerprint, picture and bar-code identification, industrial automation, robotics and bioinformatics. This paper shows that a target pattern may be matched with a library of patterns within any specified error tolerance with a single deterministic threshold function. This function for n bit patterns can be implemented in nanotechnology using 2n + 1 unit area RTDs and one RTD of 1.5 times unit area and is configurable for any error tolerance and any given target pattern. keywords: approximate pattern matching, threshold circuits, RTD, nanotechnology, reconfiguration
منابع مشابه
Reconfigurable approximate pattern matching architectures for nanotechnology
Approximate pattern matching is comparing an input pattern with a target pattern with a specified error tolerance. This ability to compensate for real-world sensor errors makes approximate pattern matching an ideal choice for a wide range of applications. This paper shows that two n-bit patterns may be matched with a single stage nanotechnology architecture using 2n þ 1 unit area resonant tunne...
متن کاملAdaptive Approximate Record Matching
Typographical data entry errors and incomplete documents, produce imperfect records in real world databases. These errors generate distinct records which belong to the same entity. The aim of Approximate Record Matching is to find multiple records which belong to an entity. In this paper, an algorithm for Approximate Record Matching is proposed that can be adapted automatically with input error...
متن کاملPattern Formation by Spatially Organized Approximate Majority Reactions
Pattern formation is a topic of great interest in biology and nanotechnology. In this paper we investigate a system of spatially-organized reactions inspired by a well-known distributed algorithm for approximate majority voting, and demonstrate that this system can lead to pattern formation from a randomly initialized starting state. We also show that the approximate majority reaction scheme ca...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملApproximate Pattern Matching with Samples
We simplify in this paper the algorithm by Chang and Lawler for the approximate string matching problem, by adopting the concept of sampling. We have a more general analysis of expected time with the simpli ed algorithm for the one-dimensional case under a non-uniform probability distribution, and we show that our method can easily be generalized to the two-dimensional approximate pattern match...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006